A Distributed Range Assignment Protocol
نویسندگان
چکیده
We present a new distributed algorithm for creating and maintaining power-efficient topologies in a wireless network. The wireless nodes establish links to neighbouring nodes in a self-organizing fashion. The protocol is designed to first create a connected topology and then iteratively search for better links to reduce the overall power consumption. First results from simulated experiments with various network sizes show that the resulting topologies are close to optimal in respect to the total energy consumption.
منابع مشابه
Hybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملA New Approach to Distributed Task Assignment using Lagrangian Decomposition and Distributed Constraint Satisfaction
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization problem that has been studied for many years in the operations research community. To solve the GMAP, we introduce a novel distributed solution protocol using Lagrangian decomposition and distributed constraint satisfaction...
متن کاملA Distributed Code Assignment Algorithm with High Code Reusability for CDMA-Based Ad Hoc Networks
TWe propose a dynamic and distributed CDMA code assignment protocol for ad hoc networks. By combining the TRTS/CTS dialogue, modified busy tone signaling and power control Tmechanisms with Tour specially designed CDMA code selection rules, our protocol can not only save precious battery energy of mobile nodes, but also increase CDAM code reusability.T TOur simulation indicates that the proposed...
متن کاملDistributed Asynchronous Algorithm for Collaborative Multi-UAV Multi-Target Tracking
The use of mobile sensor networks for multi-target tracking is an active research field. This paper describes the application of a novel two-layer relaxation for high-level control and coordination of UAVs to optimally track a set of moving targets considering a limited resources scenario. Using a singlebest tracking criterion, the scheme deploys distributed algorithms constrained to ensure ful...
متن کاملDistributed Two-Layer Algorithms for Collaborative Multi-UAV Multi-Target Tracking
The use of mobile sensor networks for multi-target tracking is an active research field. This thesis describes the application of a novel two-layer relaxation for high-level control and coordination of UAVs to optimally track a set of moving targets considering a limited resources scenario. Using a single-best tracking criterion, the scheme deploys distributed algorithms constrained to ensure f...
متن کاملA Distributed Solution Protocol that Computes an Upper Bound for the Generalized Mutual Assignment Problem
The generalized mutual assignment problem (GMAP) is the combinatorial optimization (maximization) problem that can describe various distributed problem solving tasks. Recently, we have presented a communication protocol for this problem that enables the agents to find a feasible solution along with a lower bound. This paper provides a new protocol, called DisLRPU , where the agents are engaged ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009